Weighted Tardiness Scheduling with Sequence-Dependent Setups: A Benchmark Problem for Soft Computing
نویسنده
چکیده
In this paper we present a set of benchmark instances and a benchmark instance generator for a single-machine scheduling problem known as the weighted tardiness scheduling problem with sequence-dependent setups. Furthermore, we argue that it is an ideal benchmark problem for soft computing in that it is computationally hard and does not lend itself well to exact solution procedures. Additionally, it has a number of important real world applications.
منابع مشابه
Weighted Tardiness Scheduling with Sequence-Dependent Setups: A Benchmark Library
This report details a set of benchmark problem instances that we have generated for the weighted tardiness scheduling with sequence-dependent setups problem. The version of the problem without setup times is NP-Hard. The problem is further complicated by the sequence-dependent nature of the setups. Given that the weighted tardiness objective and the sequence-dependent setups constraint are both...
متن کاملThe Challenge of Sequence-Dependent Setups: Proposal for a Scheduling Competition Track on One Machine Sequencing Problems
Designing a scheduling competition to attract researchers from the several fields interested in scheduling problems seems a challenging, and highly worthwhile effort. In this paper, we propose a design for one possible track of this proposed scheduling competition. Specifically, we propose a track aimed at one machine sequencing problems. We argue that any such track must include problems with ...
متن کاملParallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups
We propose a new method of sequential and parallel speeding up of the process of solving a single machine scheduling problem with total tardiness cost function. This improvement is done on two levels: generating a neighborhood inside path relinking method (basing on new approach—blocks in solutions) and parallelization of generating paths. The obtained results are compared to the benchmark ones...
متن کاملA fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کامل